Upper minus domination in a claw-free cubic graph
نویسندگان
چکیده
We show in this paper that the upper minus domination number −(G) of a claw-free cubic graph G is at most 1 2 |V (G)|. © 2006 Published by Elsevier B.V.
منابع مشابه
Bounds on total domination in claw-free cubic graphs
A set S of vertices in a graphG is a total dominating set, denoted by TDS, ofG if every vertex ofG is adjacent to some vertex in S (other than itself). The minimum cardinality of a TDS ofG is the total domination number ofG, denoted by t(G). IfG does not contain K1,3 as an induced subgraph, then G is said to be claw-free. It is shown in [D. Archdeacon, J. Ellis-Monaghan, D. Fischer, D. Froncek,...
متن کاملOn a conjecture on total domination in claw-free cubic graphs: proof and new upper bound
In 2008, Favaron and Henning proved that if G is a connected claw-free cubic graph of order n ≥ 10, then the total domination number γt(G) of G is at most 5 11 n, and they conjectured that in fact γt(G) is at most 4 9 n (see [O. Favaron and M.A. Henning, Discrete Math. 308 (2008), 3491–3507] and [M.A. Henning, Discrete Math. 309 (2009), 32–63]). In this paper, in a first step, we prove this con...
متن کاملOn connected k-domination in graphs
Let G = (V (G), E(G)) be a simple connected graph, and let k be a positive integer. A subset D ⊆ V (G) is a connected k-dominating set of G if its induced subgraph is connected and every vertex of V (G) −D is adjacent to at least k vertices of D. The connected k-domination number γ k(G) is the minimum cardinality among the connected k-dominating sets of G. In this paper, we give some properties...
متن کاملGeneralized power domination of graphs
In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for chordal graphs a...
متن کاملUpper minus total domination in small-degree regular graphs
A function f :V (G) → {−1, 0, 1} defined on the vertices of a graph G is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. An MTDF f is minimal if there does not exist an MTDF g:V (G) → {−1, 0, 1}, f = g, for which g(v) f (v) for every v ∈ V (G). The weight of an MTDF is the sum of its function values over all vertices. The mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006